Kasteleyn Cokernels
نویسنده
چکیده
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is defined over a principal ideal domain, this is equivalent to considering its Smith normal form or its cokernel. Many variations of the enumeration methods result in equivalent matrices. In particular, Gessel-Viennot matrices are equivalent to Kasteleyn-Percus matrices. We apply these ideas to plane partitions and related planar of tilings. We list a number of conjectures, supported by experiments in Maple, about the forms of matrices associated to enumerations of plane partitions and other lozenge tilings of planar regions and their symmetry classes. We focus on the case where the enumerations are round or q-round, and we conjecture that cokernels remain round or q-round for related “impossible enumerations” in which there are no tilings. Our conjectures provide a new view of the topic of enumerating symmetry classes of plane partitions and their generalizations. In particular we conjecture that a qspecialization of a Jacobi-Trudi matrix has a Smith normal form. If so it could be an interesting structure associated to the corresponding irreducible representation of SL(n, C ). Finally we find, with proof, the normal form of the matrix that appears in the enumeration of domino tilings of an Aztec diamond.
منابع مشابه
A Note on Kernels, Images, and Cokernels in the Perverse Category
We discuss the relationship between kernels, images and cokernels of morphisms between perverse sheaves and induced maps on stalk cohomology.
متن کاملPersistent homology for kernels, images, and cokernels
Motivated by the measurement of local homology and of functions on noisy domains, we extend the notion of persistent homology to sequences of kernels, images, and cokernels of maps induced by inclusions in a filtration of pairs of spaces. Specifically, we note that persistence in this context is well defined, we prove that the persistence diagrams are stable, and we explain how to compute them.
متن کاملBinary Codes and Kasteleyn 3-matrices
Abstract. Two cornerstones of the Kasteleyn method are: 1. rewriting the Ising partition function as the dimer partition function, that is, the generating function of the perfect matchings, and 2. expressing the dimer partition function of planar graphs as the determinant. This paper initiates the 3-dimensional Kasteleyn method. We show that the weight enumerator of any binary linear code is po...
متن کاملSingular Polynomials of Generalized Kasteleyn Matrices
Kasteleyn counted the number of domino tilings of a rectangle by considering a mutation of the adjacency matrix: a Kasteleyn matrix K. In this paper we present a generalization of Kasteleyn matrices and a combinatorial interpretation for the coefficients of the characteristic polynomial of KK (which we call the singular polynomial), where K is a generalized Kasteleyn matrix for a planar biparti...
متن کاملVariations on a theme of Kasteleyn, with Application to the Totally Nonnegative Grassmannian
We provide a short proof of a classical result of Kasteleyn, and prove several variants thereof. One of these results has become key in the parametrization of positroid varieties, and thus deserves the short direct proof which we provide.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 9 شماره
صفحات -
تاریخ انتشار 2002